Automatic Compositional Verification of Timed Systems
نویسندگان
چکیده
Specification and verification of real-time systems are important research topics with crucial applications; however, the so-called state space explosion problem often prevents model checking to be used in practice for large systems. In this work, we present a self-contained toolkit to analyze real-time systems specified using event-recording automata (ERAs), which supports system modeling, animated simulation and automatic compositional verification based on learning techniques. To the best of our knowledge, it is the first tool supporting fully automatic compositional verification for timed systems. Experimental results show that our tool outperforms the state-of-the-art timed model checkers.
منابع مشابه
Symmetry Reduction and Compositional Verification of Timed Automata
Timed automata provide a model for studying the behavior of finite-state systems as they evolve over time. We describe a technique that incorporates automatic symmetry detection and symmetry reduction in the analysis of systems modeled by timed automata. Our prototype extends the realtime model checker PAT with symmetry reduction using state swaps to reduce time and memory consumption. Moreover...
متن کاملCompositional Verification for Timed Systems Based on Automatic Invariant Generation
We propose a method for compositional verification to address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints...
متن کاملCompositional Verification of Timed Systems
In this paper we address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations betw...
متن کاملCompositional Verification of Timed Components using PVS
We present a general framework to support the compositional verification of timed systems using the interactive theorem prover PVS. The framework is based on timed traces that are an abstraction of the timed semantics of flat UML state machines. We define a compositional proof rule for parallel composition and prove its soundness in PVS. After composition, a hiding rule can be applied to hide i...
متن کاملTimed Modal Specification - Theory and Tools
In this paper we present the theory of Timed Modal Specifications (TMS) together with its implementation, the tool Epsilon. TMS and Epsilon are timed extensions of respectively Modal Specifications [Lar90, LT88] and the Tav system [GLZ89, BLS92]. The theory of TMS is an extension of real–timed process calculi with the specific aim of allowing loose or partial specifications. Looseness of specif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012